Extremal results for odd cycles in sparse pseudorandom graphs
نویسندگان
چکیده
We consider extremal problems for subgraphs of pseudorandom graphs. Our results implies that for (n, d, λ)-graphs Γ satisfying λ2k−1 ≪ d 2k n (log n)−2(k−1)(2k−1) any subgraph G ⊂ Γ not containing a cycle of length 2k + 1 has relative density at most 12 + o(1). Up to the polylog-factor the condition on λ is best possible and was conjectured by Krivelevich, Lee and Sudakov.
منابع مشابه
Extremal results in sparse pseudorandom graphs
Szemerédi’s regularity lemma is a fundamental tool in extremal combinatorics. However, the original version is only helpful in studying dense graphs. In the 1990s, Kohayakawa and Rödl proved an analogue of Szemerédi’s regularity lemma for sparse graphs as part of a general program toward extending extremal results to sparse graphs. Many of the key applications of Szemerédi’s regularity lemma us...
متن کاملExtremal Graph for Intersecting Odd Cycles
An extremal graph for a graph H on n vertices is a graph on n vertices with maximum number of edges that does not contain H as a subgraph. Let Tn,r be the Turán graph, which is the complete r-partite graph on n vertices with part sizes that differ by at most one. The well-known Turán Theorem states that Tn,r is the only extremal graph for complete graph Kr+1. Erdős et al. (1995) determined the ...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملPowers of Hamilton Cycles in Pseudorandom Graphs
We study the appearance of powers of Hamilton cycles in pseudorandom graphs, using the following comparatively weak pseudorandomness notion. A graph G is (ε, p, k, l)-pseudorandom if for all disjoint X and Y ⊆ V (G) with |X| ≥ εpkn and |Y | ≥ εpln we have e(X,Y ) = (1± ε)p|X||Y |. We prove that for all β > 0 there is an ε > 0 such that an (ε, p, 1, 2)-pseudorandom graph on n vertices with minim...
متن کاملOn a conjecture of Erdős and Simonovits: Even cycles
Let F be a family of graphs. A graph is F-free if it contains no copy of a graph in F as a subgraph. A cornerstone of extremal graph theory is the study of the Turán number ex(n,F), the maximum number of edges in an F-free graph on n vertices. Define the Zarankiewicz number z(n,F) to be the maximum number of edges in an F-free bipartite graph on n vertices. Let Ck denote a cycle of length k, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 44 شماره
صفحات -
تاریخ انتشار 2013